Vertex Cover Approximations on Random Graphs
نویسندگان
چکیده
The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2 − o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to find approximate vertex covers for a large collection of randomly generated graphs. These reductions are extremely fast and even though they, by themselves are not guaranteed to find a vertex cover, we manage to find a 3 2 -approximate vertex cover for almost every single random graph we generate.
منابع مشابه
Bounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملSequential Monte Carlo for counting vertex covers in general graphs
In this paper we describe a Sequential Importance Sampling (SIS) procedure for counting the number of vertex covers in general graphs. The optimal SIS proposal distribution is the uniform over a suitably restricted set, but is not implementable. We will consider two proposal distributions as approximations to the optimal. Both proposals are based on randomization techniques. The first randomiza...
متن کاملOptimization of Unweighted Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out....
متن کاملKernels for the Vertex Cover Problem on the Preferred Attachment Model
We examine the behavior of two kernelization techniques for the vertex cover problem viewed as preprocessing algorithms. Specifically, we deal with the kernelization algorithms of Buss and of Nemhauser & Trotter. Our evaluation is applied to random graphs generated under the preferred attachment model, which is usually met in real word applications such as web graphs and others. Our experiments...
متن کاملVertex cover on other graph ensembles: the effect of degree–degree correlations
The vertex cover is a subset Vvc ⊂ V of vertices of a graph G(V,E) such that it contains at least one endpoint of each vertex e ∈ E. Solving for the minimum vertex cover, i.e. one with the smallest number of vertices, is in general an NP-complete problem. However, in practice many relatively simple algorithms are able to produce optimum or nearly-optimum results with short running times for som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007